A checkpointing-recovery scheme for domino free distributed systems

Many communication induced checkpointing algorithms have been proposed for asynchronous cooperating processes. All of them suffer from overhead due both to the exchange of control information and to the insertion of local checkpoints additional to the basic ones. In this paper we propose a low overhead checkpointing-recovery scheme. It consists of a domino-free checkpointing algorithm plus an asynchronous recovery scheme. The main characteristic of the proposed checkpointing-recovery scheme is the minimization of the number of the overall local checkpoints. A simulation study is also presented which quantifies such a reduction.